Parallel overlapping domain decomposition methods for coupled inverse elliptic problems
نویسندگان
چکیده
منابع مشابه
Overlapping Domain Decomposition Methods for Linear Inverse Problems
We shall derive and propose several efficient overlapping domain decomposition methods for solving some typical linear inverse problems, including the identification of the flux, the source strength and the initial temperature in second order elliptic and parabolic systems. The methods are iterative, and computationally very efficient: only local forward and adjoint problems need to be solved i...
متن کاملOverlapping Domain Decomposition and Multigrid Methods for Inverse Problems
Our emphasis is on the numerical treatment of discontinuous coefficient and efficiency of the numerical methods. It is well known that such an inverse problem is illposed. Its numerical solution often suffers from undesirable numerical oscillation and very slow convergence. When the coefficient is smooth, successful numerical methods have been developed in [5] [7]. When the coefficient has larg...
متن کاملDomain Decomposition Methods for Inverse Problems
Inverse problems related to the estimation of coeecients of partial diierential equations are illposed. Practical applications often use the t-to-data output-least-square's method to recover the coeecients. In this work, we develop parallel nonoverlapping domain decomposition algorithms to estimate the diiusion coeecient associated with elliptic diierential equations. In order to realize the do...
متن کاملParallel Subdomain-based Preconditioner for Non-overlapping Domain Decomposition Methods Parallel Subdomain-based Preconditioner for Non-overlapping Domain Decomposition Methods
We present a new parallelizable preconditioner that is used as the local component for a two-level preconditioner similar to BPS. On 2D model problems that exhibit either high anisotropy or discontinuity, we demonstrate its attracting numerical behaviour and compare it to the regular BPS. Finally, to alleviate the construction cost of this new preconditioner, that requires the explicit computat...
متن کاملOverlapping Domain Decomposition Methods
Overlapping domain decomposition methods are efficient and flexible. It is also important that such methods are inherently suitable for parallel computing. In this chapter, we will first explain the mathematical formulation and algorithmic composition of the overlapping domain decomposition methods. Afterwards, we will focus on a generic implementation framework and its applications within Diff...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications in Applied Mathematics and Computational Science
سال: 2009
ISSN: 2157-5452,1559-3940
DOI: 10.2140/camcos.2009.4.1